Discovery of multivalued dependencies from relations

نویسندگان

  • Iztok Savnik
  • Peter A. Flach
چکیده

Discovery of multivalued dependencies from database relations is viewed as a search in a hypothesis space de ned according to the generalisation relationship among multivalued dependencies Two algorithms for the dis covery of multivalued dependencies from relations are presented The top down algorithm enumerates the hypotheses from the most general to more speci c hypotheses which are checked on the input relation The bottom up algorithm rst computes the invalid multivalued dependencies Starting with the most general dependencies the algorithm iteratively re nes the set of dependencies to conform with each particular invalid dependency The implementation of the algorithms is analysed and some empirical re

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Database Dependency Discovery: A Machine Learning Approach

Database dependencies, such as functional and multivalued dependencies, express the presence of structure in database relations, that can be utilised in the database design process. The discovery of database dependencies can be viewed as an induction problem, in which general rules (dependencies) are obtained from specific facts (the relation). This viewpoint has the advantage of abstracting aw...

متن کامل

Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis

Functional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of the notion of functional dependency are the socalled degenerate multivalued dependencies, and multivalued dependencies proper. We propose here a new Galois connection, based on a...

متن کامل

Characterizations of Multivalued Dependencies and Related Expressions

We study multivalued dependencies, as well as the propositional formulas whose deduction calculus parallels that of multivalued dependencies, and the variant known as degenerated multivalued dependencies. For each of these sorts of expressions, we provide intrinsic characterizations in purely semantic terms. They naturally generalize similar properties of functional dependencies or Horn clauses.

متن کامل

Multivalued Dependencies in XML

Functional dependencies (FDs) and multivalued dependencies (MVDs) play a fundamental role in relational databases where they provide semantics for the data and at the same time are the foundation for database design. Since XML documents are closely coupled with relational databases in that XML documents are typically exported and imported from relational databases, the study of FDs and MVDs in ...

متن کامل

The Expanded Implication Problem of

The implication problem is the problem of deciding whether a given set of dependencies entails other dependencies. Up to now, the entailment of excluded dependencies or independencies is only regarded on a metalogical level, which is not suitable for an automatic inference process. But, the inference of independencies is of great importance for new topics in database research like knowledge dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Intell. Data Anal.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2000